Code generator matrices as RNG conditioners
نویسندگان
چکیده
منابع مشابه
Code generator matrices as RNG conditioners
We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random variable and the weight distribution of the code. Previously known bounds on the performance of linear binary codes as entropy extractors can be derived by conside...
متن کاملSource code with cost as a nonuniform random number generator
We show that an optimal source code with cost function for code symbols can be regarded as a random number generator generating a random sequence (not necessarily a sequence of fair coin bits) as the target distribution in the sense that the normalized conditional divergence between the distribution of the generated codeword distribution and the target distribution vanishes as the block length ...
متن کاملCode Generator Testing in Practice
This paper provides an overview of a practice-oriented testing approach for code generation tools. The main application area for the testing approach presented here is the testing of optimisations performed by the code generator. The test models and corresponding test vectors generated represent an important component in a comprehensive test suite for code generators.
متن کاملA retargetable vector code generator
This paper describes the prototype implementation of a retargetable vector code generator which applies recent advances in automatic (scalar) code generation techniques to the task of generating code for a vector source language. The source language is a subset of Fortran 8X, the proposed successor to the Fortran 77 standard. The target machine is an attached vector processor. This work extends...
متن کاملA Machine-Verified Code Generator
We consider the machine-supported verification of a code generator computing machine code from WHILE-programs, i.e. abstract syntax trees which may be obtained by a parser from programs of an imperative programming language. We motivate the representation of states developed for the verification, which is crucial for success, as the interpretation of tree-structured WHILE-programs differs signi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2017
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2017.05.005